Geometric and spectral properties of locally tessellating planar graphs

نویسندگان

  • Matthias Keller
  • Norbert Peyerimhoff
چکیده

In this article, we derive bounds for values of the global geometry of locally tessellating planar graphs, namely, the Cheeger constant and exponential growth, in terms of combinatorial curvatures. We also discuss spectral implications for the Laplacians.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cheeger constants, growth and spectrum of locally tessellating planar graphs

In this article, we study relations between the local geometry of planar graphs (combinatorial curvature) and global geometric invariants, namely the Cheeger constants and the exponential growth. We also discuss spectral applications.

متن کامل

Curvature, Geometry and Spectral Properties of Planar Graphs

We introduce a curvature function for planar graphs to study the connection of curvature and geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite, locally similar to a tessellation and admits no cut locus. For negative curvature we prove empty interior of minimal bigons and explicit bounds for the growth of distance balls and Che...

متن کامل

On the total version of geometric-arithmetic index

The total version of geometric–arithmetic index of graphs is introduced based on the endvertex degrees of edges of their total graphs. In this paper, beside of computing the total GA index for some graphs, its some properties especially lower and upper bounds are obtained.

متن کامل

Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs

Algorithms for the construction of spanning planar subgraphs of Unit Disk Graphs (UDGs) do not ensure connectivity of the resulting graph under single edge deletion. To overcome this deficiency, in this paper we address the problem of augmenting the edge set of planar geometric graphs with straight line edges of bounded length so that the resulting graph is planar and 2-edge connected. We give ...

متن کامل

An Alexandroff topology on graphs

Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008